Monotone Dynamic Programming
نویسنده
چکیده
By integrating dynamic programming with the theory of order preserving dynamical systems (Hirsch (1982), Smith (1995)) this paper develops a new approach to stability analysis in continuous-time dynamic optimization models. The main results provide simple conditions on the primitives of a model which imply that steady states exist and are globally stable for initial conditions in an open dense set. If the steady state is unique or lattice methods are employed in their study; this completely resolves all stability questions. The methods’ applicability is demonstrated through examples from investment theory, growth theory, and renewable resource economics.
منابع مشابه
Interchangeability principle and dynamic equations in risk averse stochastic programming
In this paper we consider interchangeability of the minimization operator with monotone risk functionals. In particular we discuss the role of strict monotonicity of the risk functionals. We also discuss implications to solutions of dynamic programming equations of risk averse multistage stochastic programming problems.
متن کاملOn submodular value functions and complex dynamic programming
We investigate in this paper submodular value functions using complex dynamic programming. In complex dynamic programming (dp) we consider concatenations and linear combinations of standard dp operators, as well as combinations of maximizations and minimizations. These value functions have many applications and interpretations, both in stochastic control (and stochastic zero-sum games) as well ...
متن کاملAn FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
We present a fully polynomial time approximation scheme (FPTAS) for a capacitated economic lot-sizing problem with a monotone cost structure. An FPTAS delivers a solution with a given relative error ε in time polynomial in the problem size and in 1/ε. Such a scheme was developed by van Hoesel and Wagelmans [8] for a capacitated economic lot-sizing problem with monotone concave (convex) producti...
متن کاملDynamic Bid Prices in Revenue Management
We formally derive the standard deterministic linear program (LP) for bid-price control by making an affine functional approximation to the optimal dynamic programming value function. This affine functional approximation gives rise to a new LP that yields tighter bounds than the standard LP. Whereas the standard LP computes static bid prices, our LP computes a time trajectory of bid prices. We ...
متن کاملMonotone Dynamic Programming: Director’s Cut
By integrating dynamic programming with the theory of order preserving dynamical systems (Hirsch (1982), Smith (1995)) this paper develops a new approach to stability analysis in dynamic economic models. The main results provide simple conditions on the primitives of a model which imply that steady states are globally stable for almost all initial conditions. If the steady state is unique or la...
متن کاملParallel Corpora Segmentation Using Anchor Words*
A new technique for monotone segmentation of parallel corpora is introduced. This segmentation is based on a set of anchor words which are defined manually. The parallel segments are computed using a dynamic programming algorithm. To assess this technique, finite-state transducers are inferred from both non-segmented and segmented corpora. Experiments have been carried out with Spanish-English ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003